Apiary Views of the Berenstein-zelevinsky Polytope, and Klyachko’s Saturation Conjecture

نویسنده

  • ALLEN KNUTSON
چکیده

Recently Klyachko [K] has given linear inequalities on triples (λ, μ, ν) of dominant weights of GLn(C) necessary for the the corresponding Littlewood-Richardson coefficient dim(Vλ⊗Vμ⊗Vν) GLn(C) to be positive. We show that these conditions (and an evident congruency condition) are also sufficient, which was known as the saturation conjecture. In particular this proves Horn’s conjecture, giving a related system of inequalities [H, K]. 1. The saturation conjecture A very old and fundamental question about the representation theory of GLn(C) is the following: For which triples of dominant weights λ, μ, ν does the tensor product Vλ⊗Vμ⊗Vν of the irreducible representations with those high weights contain a GLn(C)invariant vector? One obvious condition is that λ+ μ+ ν be in the root lattice; otherwise there is no torusinvariant, much less GLn(C)-invariant, vector. Another standard formulation of the problem above is to ask for which ν does Vλ⊗Vμ contain the dual representation to Vν . Recently, Klyachko has given an answer to this question, which in one direction is only asymptotic: If Vλ⊗Vμ⊗Vν has a GLn(C)-invariant vector, then λ, μ, ν satisfy a certain system of linear inequalities derived from Schubert calculus. Conversely, if λ, μ, ν satisfy these inequalities, then there exists an integer N such that the tensor product VNλ⊗VNμ⊗VNν has a GLn(C)-invariant vector. Klyachko then states the saturation conjecture, that the full (nonasymptotic) converse of the first statement should be true (in presence of the obvious condition that λ+ μ+ ν be in the root lattice). He also points out an important consequence: Horn’s conjecture [H] from Date: March 2, 2008. Supported by an NSF Postdoctoral Fellowship. Partially supported by NSF grant DMS-9706764. Klyachko gives a finite set of inequalities, that as a set are necessary and sufficient for this asymptotic result. However, Chris Woodward has informed us that contrary to Klyachko’s unproven claim in [K], the inequalities are not independent – not all of them determine facets of the cone.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Honeycomb Model of the Berenstein-zelevinsky Polytope I. Klyachko’s Saturation Conjecture

Recently Klyachko [K] has given linear inequalities on triples (λ, μ, ν) of dominant weights of GLn(C) necessary for the the corresponding Littlewood-Richardson coefficient dim(Vλ⊗Vμ⊗Vν) GLn(C) to be positive. We show that these conditions are also sufficient, which was known as the saturation conjecture. In particular this proves Horn’s conjecture from 1962, giving a recursive system of inequa...

متن کامل

0 su ( N ) tensor product multiplicities and virtual Berenstein - Zelevinsky triangles

Information on su(N) tensor product multiplicities is neatly encoded in Berenstein-Zelevinsky triangles. Here we study a generalisation of these triangles by allowing negative as well as positive integer entries. For a fixed triple product of weights, these generalised Berenstein-Zelevinsky triangles span a lattice in which one may move by adding integer linear combinations of so-called virtual...

متن کامل

51 v 2 1 3 Fe b 20 01 su ( N ) tensor product multiplicities and virtual Berenstein - Zelevinsky triangles

Information on su(N) tensor product multiplicities is neatly encoded in Berenstein-Zelevinsky triangles. Here we study a generalisation of these triangles by allowing negative as well as positive integer entries. For a fixed triple product of weights, these generalised Berenstein-Zelevinsky triangles span a lattice in which one may move by adding integer linear combinations of so-called virtual...

متن کامل

2 00 1 su ( N ) tensor product multiplicities and virtual Berenstein - Zelevinsky triangles

Information on su(N) tensor product multiplicities is neatly encoded in Berenstein-Zelevinsky triangles. Here we study a generalisation of these triangles by allowing negative as well as non-negative integer entries. For a fixed triple product of weights, these generalised Berenstein-Zelevinsky triangles span a lattice in which one may move by adding integer linear combinations of so-called vir...

متن کامل

Berenstein-Zelevinsky triangles, elementary couplings and fusion rules

We present a general scheme for describing ŝu(N)k fusion rules in terms of elementary couplings, using Berenstein-Zelevinsky triangles. A fusion coupling is characterized by its corresponding tensor product coupling (i.e. its Berenstein-Zelevinsky triangle) and the threshold level at which it first appears. We show that a closed expression for this threshold level is encoded in the Berenstein-Z...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998